A “Tough Nuts” Track for the IPC
نویسنده
چکیده
In the development of the IPC, there is an ongoing conflict between pushing the frontiers, and consolidating our technology. With growing PDDL, it becomes ever more difficult to achieve both. We propose to introduce a separate instrument for consolidation. A “tough nut” is a domain that can be addressed, language-wise, by existing planning techniques, but that cannot be solved efficiently. In a tough nuts track, domains would be submitted to the IPC committee, and a web repository of accepted domains and results would be maintained. A domain can be removed if it is considered “solved”. Awards can be given to the first technique that solves a domain, and to the domains that survive longest. This simple mechanism naturally keeps track of the challenges remaining behind the moving frontier of PDDL. It explicits open questions and encourages research on subtle issues.
منابع مشابه
5th International Planning Competition: Non-deterministic Track Call For Participation
The 5th International Planning Competition will be colocated with ICAPS-06. This IPC edition will contain a track on nondeterministic and probabilistic planning as the continuation of the probabilistic track at IPC-4. The non-deterministic track will evaluate systems for conformant, non-deterministic and probabilistic planning under different criteria. This document describes the general goals ...
متن کاملFrom Tough Nuts to Touch-Me-Nots
An intricate arrangement of different cell types is required for the spring-loaded mechanism of spontaneous seed dispersal typical for many fruits. Liljegren and colleagues (2004 [this issue of Cell]) describe a nonlinear network of transcription factor genes controlling this process.
متن کاملMining IPC-2011 Results
The International Planning Competition (IPC) offers a wonderful scope to evaluate and compare different planning approaches and specific planner implementations in benchmark domains. In IPC 2011, the software generated for the competition permits to obtain a lot of data about the execution of all the planners in the different tracks in a simple way, which permits its recovery and use. In this w...
متن کاملIntroduction to the Probabilistic Planning Track
The 2004 International Planning Competition, IPC-4, includes a probabilistic planning track for the first time. We briefly summarize the design of the track.
متن کاملThe International Competition of Distributed and Multiagent Planners (CoDMAP)
gence, proposes possibly tractable, heuristic, and algorithmic solutions to computationally hard combinatorial problems of sequential decision making. In the case of domain-independent planning, the input of a planner does not contain only the planning problem instance but also its domain, compactly describing the mechanics of the environment. The history of competitions of domain-independent a...
متن کامل